# -*- coding: utf-8 -*-
"""
Created on Wed Sep 16 14:02:31 2020

@author: Administrator
"""

'''
Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]
Example 2:

Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]
'''

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        
        '''
        20200916--李运辰
        
        '''
        
        rlist=[-1,-1]
        count=0
        if len(nums)==0:
            return [-1,-1]
        
        for i in range(0,len(nums)):
            
             if nums[i]==target:
                
                if count==2:
                    rlist[count-1]=i
                else:
                    rlist[count]=i
                    if count==0:
                        rlist[count+1]=i
                    count +=1
            
        
        
        
        
        
        return rlist